Computing quotients by connected solvable groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solvable Quotients of Kähler Groups

We prove several results on the structure of solvable quotients of fundamental groups of compact Kähler manifolds (Kähler groups).

متن کامل

A-homotopy groups, excision, and solvable quotients

We study some properties of A-homotopy groups: geometric interpretations of connectivity, excision results, and a re-interpretation of geometric quotients by solvable groups in terms of covering spaces in the sense of A-homotopy theory. These concepts and results are well-suited to the study of certain quotients via geometric invariant theory. As a case study in geometry of solvable group quoti...

متن کامل

Hyper–Kähler Quotients of Solvable Lie Groups

In this paper we apply the hyper-Kähler quotient construction to Lie groups with a left invariant hyper-Kähler structure under the action of a closed abelian subgroup by left multiplication. This is motivated by the fact that some known hyper-Kähler metrics can be recovered in this way by considering different Lie group structures on Hp× H (H: the quaternions). We obtain new complete hyper-Kähl...

متن کامل

Computing in Solvable Matrix Groups

We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems unlikely for membership-testing, which subsumes the discrete-log problem. However, assuming that the primes in jGj (other than the eld characteristic) are polynomiallybounded, membership-testing and many other computat...

متن کامل

Computing Subgroups by Exhibition in Finite Solvable Groups

Subgroups such as Hall systems, system normalizers, F-normalizers and F-covering subgroups arise naturally in the study of finite solvable groups. Here we present practical algorithms to compute such subgroups. Besides being of interest in the theory of formations, the algorithms also yield fast methods for constructing head complements. These complements are closely related to the maximal subg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2020

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2020.07.014